Researching Recent U.S. Legislation Using Free Sites on the Internet

Abstract

This study investigates the effects of gender, college status, and prior Internet experience on the use of Internet resources. The subjects were 96 patrons randomly selected from those using the Internet terminals at the University Library of the University at Albany, SUNY, during the first two months of 1995. We found that the majority of users shared the following characteristics: they are male undergraduates affiliated with the social sciences and are novice users who have less than six months experience. Respondents felt strongly that the Internet is useful, and has been an important resource for their research and assignments. Users have high expectations of searching capabilities, while they feel neutral or disappointed with browsing. Our findings indicate that libraries should provide access to the Internet. They also suggest that libraries should take the lead in developing searchable indexes and making info-bases better organized for the ease and effectiveness of browsing.     

Contention-based forwarding with multi-hop connectivity awareness in vehicular ad-hoc networks

Recent vehicular routing proposals use real-time road traffic density estimates to dynamically select forwarding paths. Estimating the traffic density in vehicular ad hoc networks requires the transmission of additional dedicated messages increasing the communications load. These proposals are generally based on unicast sender-based forwarding schemes. The greedy nature of sender-based forwarding can result in the selection of forwarders with weak radio links that might compromise the end-to-end performance. To overcome these limitations, this paper presents TOPOCBF, a novel contention-based broadcast forwarding protocol that dynamically selects forwarding paths based on their capability to route packets between anchor points. Such capability is estimated by means of a multi-hop connectivity metric. The obtained results demonstrate that TOPOCBF can provide good packet delivery ratios while reducing the communications load compared to unicast sender-based forwarding schemes using road traffic density estimates.     

Improving fairness in IEEE 802.11 networks using MAC layer opportunistic retransmission

This paper introduces DAFMAC (Decode And Forward MAC), a scalable opportunistic cooperative retransmission enhancement for the IEEE 802.11 MAC protocol which operates without the need for additional explicit control signalling. Distributed opportunistic retransmission algorithms rely on selecting a single suitable relay without direct arbitration between nodes. Simulations show that DAFMAC offers a significant improvement in fairness for both throughput and jitter, giving multiple parallel data flows a more equal opportunity to utilise the channel. DAFMAC cooperative retransmissions are shown to reduce node energy consumption for a given throughput. Further, the DAFMAC relay selection algorithm is shown to scale very well in terms of complexity and memory requirements in comparison to other cooperative retransmission schemes.     

P2P中一种基于小世界聚类的资源搜索模型

为有效解决P2P中不同资源的搜索和定位问题,设计了一种基于小世界聚类的资源搜索模型。以小世界模型为理论基础,构建具有局域聚集现象及短的路径的P2P网络模型,按照分级转发方式对资源进行全局搜索。仿真实验证明,这种基于小世界聚类的资源搜索模型具有较高的搜索成功率和较短的平均搜索路径。     

Optimal models for single-period supply chain problems with fuzzy demand

The aim of this paper is to develop an optimal technique for dealing with the fuzziness aspect of demand uncertainties. Triangular fuzzy numbers are used to model external demand, and decision models in both non-coordination and coordination situations are constructed. It is shown that in the decision models there exists a unique solution that can be expressed analytically. Based on the closed form solutions for both models, the behaviors and relationships of both the manufacturer and the retailer are quantitatively analyzed, and a cooperative policy for the optimization of the whole supply chain is put forward.     

Stabilization of symmetric formations to motion around convex loops

We provide a cooperative control algorithm to stabilize symmetric formations to motion around closed curves suitable for mobile sensor networks. This work extends previous results for stabilization of symmetric circular formations. We study a planar particle model with decentralized steering control subject to limited communication. Because of their unique spectral properties, the Laplacian matrices of circulant graphs play a key role. We illustrate the result for a skewed superellipse, which is a type of curve that includes circles, ellipses, and rounded parallelograms.     

Virtual reality for collaborative e-learning

In the past, the term e-learning referred to any method of learning that used electronic delivery methods. With the advent of the Internet however, e-learning has evolved and the term is now most commonly used to refer to online courses. A multitude of systems are now available to manage and deliver learning content online. While these have proved popular, they are often single-user learning environments which provide little in the way of interaction or stimulation for the student. As the concept of lifelong learning now becomes a reality and thus more and more people are partaking in online courses, researchers are constantly exploring innovative techniques to motivate online students and enhance the e-learning experience. This article presents our research in this area and the resulting development of CLEV-R, a Collaborative Learning Environment with Virtual Reality. This web-based system uses Virtual Reality (VR) and multimedia and provides communication tools to support collaboration among students. In this article, we describe the features of CLEV-R, its adaptation for mobile devices and present the findings from an initial evaluation.     

Monotony properties of connected visible graph searching

Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to its pathwidth plus 1, and the visible search number of a graph is equal to its treewidth plus 1. The connected variants of these games ask for search strategies that are connected, i.e., at every step of the strategy, the searched part of the graph induces a connected subgraph. We focus on monotone search strategies, i.e., strategies for which every node is searched exactly once. The monotone connected visible search number of an n-node graph is at most O(logn) times its visible search number. First, we prove that this logarithmic bound is tight. Precisely, we prove that there is an infinite family of graphs for which the ratio monotone connected visible search number over visible search number is Ω(logn). Second, we prove that, as opposed to the non-connected variant of visible graph searching, “recontamination helps” for connected visible search. Precisely, we prove that, for any k4, there exists a graph with connected visible search number at most k, and monotone connected visible search number >k     

An optimized modular neural network controller based on environment classification and selective sensor usage for mobile robot reactive navigation

A new approach to the design of a neural network (NN) based navigator is proposed in which the mobile robot travels to a pre-defined goal position safely and efficiently without any prior map of the environment. This navigator can be optimized for any user-defined objective function through the use of an evolutionary algorithm. The motivation of this research is to develop an efficient methodology for general goal-directed navigation in generic indoor environments as opposed to learning specialized primitive behaviors in a limited environment. To this end, a modular NN has been employed to achieve the necessary generalization capability across a variety of indoor environments. Herein, each NN module takes charge of navigating in a specialized local environment, which is the result of decomposing the whole path into a sequence of local paths through clustering of all the possible environments. We verify the efficacy of the proposed algorithm over a variety of both simulated and real unstructured indoor environments using our autonomous mobile robot platform.     

Web挖掘在电子商务货源搜索中的应用

在电子商务环境下,货源信息的质量将直接影响企业业务经营水平。该文对电子商务环境下的货源信息搜索问题进行分析,提出以万维网为信息源,采用Web挖掘和信息检索技术设计实现货源搜索机器人的方法。该机器人内置元搜索引擎,可以扩大搜索范围,通过对搜索信息进行分析处理,从中发现有价值的货源相关信息。